A Moving-knife Solution to the Four-person Envy-free Cake-division Problem
نویسندگان
چکیده
We present a moving-knife procedure, requiring only 11 cuts, that produces an envy-free allocation of a cake among four players and discuss possible extensions to five players.
منابع مشابه
N-person Envy-free Chore Division
In this paper we consider the problem of chore division, which is closely related to a classical question, due to Steinhaus [7], of how to cut a cake fairly. We focus on constructive solutions, i.e., those obtained via a well-defined procedure or algorithm. Among the many notions of fairness is envy-freeness: an envy-free cake division is a set of cuts and an allocation of the pieces that gives...
متن کاملExact Procedures for Envy-free Chore Division
We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...
متن کاملEquilibrium analysis in cake cutting
Cake cutting is a fundamental model in fair division; it represents the problem of fairly allocating a heterogeneous divisible good among agents with different preferences. The central criteria of fairness are proportionality and envy-freeness, and many of the existing protocols are designed to guarantee proportional or envy-free allocations, when the participating agents follow the protocol. H...
متن کاملCake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
The minimal number of parallel cuts required to divide a cake into n pieces is n 1. A new 3person procedure, requiring two parallel cuts, is given that produces an envy-free division, whereby each person thinks he or she receives at least a tied-for-largest piece. An extension of this procedure leads to a 4-person division, using three parallel cuts, which makes at most one person envious. Fina...
متن کاملThe Query Complexity of Cake Cutting
We study the query complexity of cake cutting and give lower bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. These lower bounds are tight for three players in the case of envy-free allocations and for two players in the case of perfect and equitable allocations. We also formalize moving knife procedures and show that a large subc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996